t-Perfection in P5-Free Graphs
نویسندگان
چکیده
A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise P5-free t-perfect graphs in terms of forbidden t-minors. Moreover, we show that P5-free t-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.
منابع مشابه
t-perfection in near-bipartite and in P5-free graphs
A graph is called t-perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise nearbipartite t-perfect and P5-free t-perfect graphs in terms of forbidden tminors. Moreover, we show that P5-free t-perfect graphs can always be coloured with three colours, and that they can be recognised in polynomial time.
متن کاملOn (P5, diamond)-free graphs
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...
متن کاملt-Perfection Is Always Strong for Claw-Free Graphs
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect if this system is totally dual integral. It is an open problem whether t-perfection is equivalent to strong t-perfection. We prove the equivalence for the class of claw-free graphs.
متن کاملPolynomial Cases for the Vertex Coloring Problem
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P5, dart)-free graphs, (P5, banner)-free graphs, (P5, bull)-free graphs, and (fork, bull)-free graphs.
متن کاملConstructions of k-critical P5-free graphs
4 With respect to a class C of graphs, a graph G ∈ C is said to be k-critical if every proper 5 subgraph of G belonging to C is k−1 colorable. We construct an infinite set of k-critical P56 free graphs for every k ≥ 5. We also prove that there are exactly eight 5-critical {P5, C5}-free 7 graphs. 8
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 31 شماره
صفحات -
تاریخ انتشار 2017